Geometric Resolution: A Proof Procedure Based on Finite Model Search
نویسندگان
چکیده
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on geometric formulas. For this reason we call the procedure geometric resolution. We expect that the procedure can be used as an efficient proof search procedure for firstorder logic. In addition, the procedure can be implemented in such a way that it is complete for finding finite models.
منابع مشابه
AN EFFICIENT OPTIMIZATION PROCEDURE BASED ON CUCKOO SEARCH ALGORITHM FOR PRACTICAL DESIGN OF STEEL STRUCTURES
Different kinds of meta-heuristic algorithms have been recently utilized to overcome the complex nature of optimum design of structures. In this paper, an integrated optimization procedure with the objective of minimizing the self-weight of real size structures is simply performed interfacing SAP2000 and MATLAB® softwares in the form of parallel computing. The meta-heuristic algorithm chosen he...
متن کاملTransonic Turbulent Flow Simulation using Pressure-Based Method and Normalized Variable Diagram
A pressure-based implicit procedure to solve the Euler and Navier-Stokes equations on a nonorthogonal mesh with collocated finite volume formulation is described. The boundedness criteria for this procedure are determined from Normalized Variable diagram (NVD) scheme.The procedure incorporates the ε−k eddy-viscosity turbulence model. The algorithm is tested for inviscid and turbulent transonic ...
متن کاملStructural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic
Logic programming (LP) is a programming language based on first-order Horn clause logic that uses SLD-resolution as a semi-decision procedure. Finite SLD-computations are inductively sound and complete with respect to least Herbrand models of logic programs. Dually, the corecursive approach to SLD-resolution views infinite SLD-computations as successively approximating infinite terms contained ...
متن کاملTheorem Proving for Classical Logic with Partial Functions by Reduction to Geometric Kleene Logic
Partial functions are abundant in mathematics and program specifications. Unfortunately, their importance has been mostly ignored in automated theorem proving. In this paper, we develop a theorem proving strategy for Partial Classical Logic (PCL). Proof search takes place in Kleene Logic. We show that PCL theories can be translated into sets of formulas in Kleene logic. For proof search in Klee...
متن کاملA Resolution Based SAT-solver Operating on Complete Assignments
Most successful systematic SAT-solvers are descendants of the DPLL procedure and so operate on partial assignments. Using partial assignments is explained by the “enumerative semantics” of the DPLL procedure. Current clause learning SAT-solvers, in a sense, have outgrown this semantics. Instead of enumerating the search space as the DPLL procedure does, they explicitly build a resolution proof....
متن کامل